An in-place min–max priority search tree
نویسندگان
چکیده
منابع مشابه
An In-Place Priority Search Tree
One of the classic data structures for storing point sets in R is the priority search tree, introduced by McCreight in 1985. We show that this data structure can be made in-place, i.e., it can be stored in an array such that each entry only stores one point of the point set. We show that the standard query operations can be answered within the same time bounds as for the original priority searc...
متن کاملAn in-place min-max priority search tree
One of the classic data structures for storing point sets in R is the priority search tree, introduced by McCreight in 1985. We show that this data structure can be made in-place, i.e., it can be stored in an array such that each entry stores only one point of the point set and no entry is stored in more than one location of that array. It combines a binary search tree with a heap. We show that...
متن کاملMinmax Tree Cover in the Euclidean Space
Let G = (V,E) be an edge-weighted graph, and let w(H) denote the sum of the weights of the edges in a subgraph H of G. Given a positive integer k, the balanced tree partitioning problem requires to cover all vertices in V by a set T of k trees of the graph so that the ratio α of maxT∈T w(T ) to w(T ∗)/k is minimized, where T ∗ denotes a minimum spanning tree of G. The problem has been used as a...
متن کاملApproximating the minmax rooted-tree cover in a tree
Given an edge-weighted rooted tree T and a positive integer p ( n), where n is the number of vertices in T , we cover all vertices in T by a set of p subtrees each of which contains the root r of T . The minmax rooted-tree cover problem asks to find such a set of p subtrees so as to minimize the maximum weight of the subtrees in the set. In this paper, we propose an O(n) time (2 + ε)-approximat...
متن کاملA tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms solve the problem in reasonable time for rather small graphs. In this paper an algorithm based on the idea of tabu search is constructed. Some properties of the local minima are shown. Exhaustive computational tests for various classes of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2012.09.007